Synchronization in random networks with given expected degree sequences
نویسندگان
چکیده
منابع مشابه
Connected components in random graphs with given expected degree sequences
We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probability proportional to the product of the expected degrees of its endpoints. We examine the distribution of the sizes/volumes of the connected components which turns out depending primarily on the average degree d and the secondorder average degree d̃. Here d̃ denotes the weigh...
متن کاملQuasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of necessity possess them all. These properties, termed quasirandom, have been described for a variety of structures such as graphs, hypergraphs, tournaments, Boolean functions, and subsets of Zn, and most recently, sparse gra...
متن کاملInduced subgraphs in sparse random graphs with given degree sequences
Let Gn,d denote the uniformly random d-regular graph on n vertices. For any S ⊂ [n], we obtain estimates of the probability that the subgraph of Gn,d induced by S is a given graph H. The estimate gives an asymptotic formula for any d = o(n1/3), provided that H does not contain almost all the edges of the random graph. The result is further extended to the probability space of random graphs with...
متن کاملMaximal entropy random networks with given degree distribution
Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the distribution of connected components. We determine the size of the percolation cluster above the percolation threshold. The conditional degree distribution on...
متن کاملGenerating random networks with given degree-degree correlations and degree-dependent clustering.
Random networks are widely used to model complex networks and research their properties. In order to get a good approximation of complex networks encountered in various disciplines of science, the ability to tune various statistical properties of random networks is very important. In this Brief Report we present an algorithm which is able to construct arbitrarily degree-degree correlated networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos, Solitons & Fractals
سال: 2008
ISSN: 0960-0779
DOI: 10.1016/j.chaos.2006.05.063